Conjugate gradient total least - squares in geophysical optimiza - tion problems
نویسنده
چکیده
Golub and Loan (1980) presented a numerically-stable TLS algorithm which utilizes the singular value decomposition (SVD). Subsequent refinements to the method predominantly use SVD, and much of the current literature emphasizes stabilization of the inverse and implicit model regularization by SVD truncation (Fierro et al., 1997). Because it is numerically intensive, however, the SVD generally proves unrealistic for use in large-scale problems, which are the rule in exploration geophysics.
منابع مشابه
Shaping regularization in geophysical estimation problems
Regularization is a required component of geophysical estimation problems that operate with insufficient data. The goal of regularization is to impose additional constraints on the estimated model. I introduce shaping regularization, a general method for imposing constraints by explicit mapping of the estimated model to the space of admissible models. Shaping regularization is integrated in a c...
متن کاملA Total Least Squares Methodfor Toeplitz
A Newton method to solve total least squares problems for Toeplitz systems of equations is considered. When coupled with a bisection scheme, which is based on an eecient algorithm for factoring Toeplitz matrices, global convergence can be guaranteed. Circulant and approximate factorization preconditioners are proposed to speed convergence when a conjugate gradient method is used to solve linear...
متن کاملBIT Submitted May 1997, Revised February 1998. A TOTAL LEAST SQUARES METHOD FOR TOEPLITZ SYSTEMS OF EQUATIONS
A Newton method to solve total least squares problems for Toeplitz systems of equations is considered. When coupled with a bisection scheme, which is based on an eecient algorithm for factoring Toeplitz matrices, global convergence can be guaranteed. Circulant and approximate factorization preconditioners are proposed to speed convergence when a conjugate gradient method is used to solve linear...
متن کاملRegularized total least squares approach for nonconvolutional linear inverse problems
In this correspondence, a solution is developed for the regularized total least squares (RTLS) estimate in linear inverse problems where the linear operator is nonconvolutional. Our approach is based on a Rayleigh quotient (RQ) formulation of the TLS problem, and we accomplish regularization by modifying the RQ function to enforce a smooth solution. A conjugate gradient algorithm is used to min...
متن کاملApplication of a Class of Preconditioners to Large Scale Linear Programming Problems
In most interior point methods for linear programming, a sequence of weighted linear least squares problems are solved, where the only changes from one iteration to the next are the weights and the right hand side. The weighted least squares problems are usually solved as weighted normal equations by the direct method of Cholesky factoriza-tion. In this paper, we consider solving the weighted n...
متن کامل